Uniform Strategies
نویسندگان
چکیده
We consider turn-based game arenas for which we explore a notion of uniform strategies, which are strategies submitted to uniformity constraints. Such constraints aim at capturing properties of strategies that are not μ-calculus definable as they involve bundles of plays. Typical examples are knowledge-based strategies in imperfect-information games, and the so-called “uniform strategies” for the game semantics of Dependence Logic. We propose a formal language to specify uniform strategies and demonstrate the relevance of the concept by capturing various issues arising from the literature.
منابع مشابه
ENHANCING WEIGHTED UNIFORM SIMULATION FOR STRUCTURAL RELIABILITY ANALYSIS
Weighted Uniform Simulation (WUS) is recently presented as one of the efficient simulation methods to obtain structural failure probability and most probable point (MPP). This method requires initial assumptions of failure probability to obtain results. Besides, it has the problem of variation in results when it conducted with few samples. In the present study three strategies have been present...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملFinding Uniform Strategies for Multi-agent Systems
We present an algorithm for finding uniform strategies in multi-agent systems with incomplete information. The algorithm finds all maximal uniform strategies for agents with incomplete information for enforcing a property expressible in the language of Alternating-time Temporal Logic ATL. The main application of the algorithm is automated program synthesis for systems that can be modeled as mul...
متن کاملA Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability
Since the introduction of Alternating-time Temporal Logic (AT L), many logics have been proposed to reason about different strategic capabilities of the agents of a system. In particular, some logics have been designed to reason about the uniform memoryless strategies of such agents. These strategies are the ones the agents can effectively play by only looking at what they observe from the curr...
متن کاملComputing Uniformly Optimal Strategies in Two-Player Stochastic Games
We provide a computable algorithm to calculate uniform ε-optimal strategies in two-player zero-sum stochastic games. Our approach can be used to construct algorithms that calculate uniform ε-equilibria and uniform correlated ε-equilibria in various classes of multi-player non-zero-sum stochastic games. JEL codes: C63, C73.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1212.0526 شماره
صفحات -
تاریخ انتشار 2012